Implementing the Nash Extension Bargaining Solution† for Non-convex Problems
نویسندگان
چکیده
Conley and Wilkie (1993) introduced and axiomatized the Nash extension bargaining solution, defined on a domain of comprehensive but not necessarily convex problems. In this paper we present a non-cooperative game that implements the Nash extension solution in subgame perfect equilibria in the limit as the discount rate applied between rounds of play vanishes. Journal of Economic Literature Classification Numbers: C71, C72.
منابع مشابه
An Extension of the Nash Bargaining Solutiony to Nonconvex Problems
We investigate the domain of comprehensive but not necessarily convex bargaining problems. Without convexity the Nash solution is not well de ̄ned. We propose a new solution, the Nash Extension, that coincides with the Nash solution when S is convex. We characterize it by Weak Pareto Optimality, Symmetry, Scale Invariance, Continuity, and a new axiom, Ethical Monotonicity. Journal of Economic Li...
متن کاملTwo-stage Bargaining Solutions
We introduce and characterize a new class of bargaining solutions: those which can be obtained by sequentially applying two binary relations to eliminate alternatives. As a by-product we obtain as a particular case a partial characterization result by Zhou (Econometrica, 1997) of an extension of the Nash axioms and solution to domains including non-convex problems, as well as a complete charact...
متن کاملBeyond Nash Bargaining Theory: The Nash Set*
We extend Nash's bargaining theory to non-convex and coalitional problems. This paper investigates the implications of Nash-like axioms for bilateral problems and the properties of consistency and converse consistency over multilateral settings. The result is a characterization of the Nash set of NTU games, defined as the solution concept where each pair of players is splitting the gains from t...
متن کاملRational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...
متن کامل2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...
متن کامل